Cross-multiplicative coalescent processes and applications

نویسندگان

چکیده

We introduce and analyze a novel type of coalescent processes called cross-multiplicative that models system with two types particles, $A$ $B$. The bonds are formed only between the pairs particles opposite same rate for each bond, producing connected components made both types. solve Smoluchowski coagulation equations obtained as hydrodynamic limit corresponding Marcus-Lushnikov process. establish kernel is gelling kernel, find gelation time. As an application, we derive limiting mean length minimal spanning tree on complete bipartite graph $K_{\alpha[n], \beta[n]}$ partitions sizes $\alpha[n]=\alpha n +o(\sqrt{n})$ $\beta[n]=\beta independent edge weights, distributed uniformly over $[0, 1]$.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new encoding of coalescent processes. Applications to the additive and multiplicative cases

We revisit the discrete additive and multiplicative coalescents, starting with n particles with unit mass. These cases are known to be related to some “combinatorial coalescent processes”: a time reversal of a fragmentation of Cayley trees or a parking scheme in the additive case, and the random graph process (G(n, p))p in the multiplicative case. Time being fixed, encoding these combinatorial ...

متن کامل

The Entrance Boundary of the Multiplicative Coalescent

The multiplicative coalescent X(t) is a l-valued Markov process representing coalescence of clusters of mass, where each pair of clusters merges at rate proportional to product of masses. From random graph asymptotics it is known (Aldous (1997)) that there exists a standard version of this process starting with infinitesimally small clusters at time −∞. In this paper, stochastic calculus techni...

متن کامل

Diffusion processes and coalescent trees

We dedicate this paper to Sir John Kingman on his 70th Birthday. In modern mathematical population genetics the ancestral history of a population of genes back in time is described by John Kingman’s coalescent tree. Classical and modern approaches model gene frequencies by diffusion processes. This paper, which is partly a review, discusses how coalescent processes are dual to diffusion process...

متن کامل

Aggregation models with limited choice and the multiplicative coalescent

The percolation phase transition and the mechanism of the emergence of the giant component through the critical scaling window for random graph models, has been a topic of great interest in many different communities ranging from statistical physics, combinatorics, computer science, social networks and probability theory. The last few years have witnessed an explosion of models which couple ran...

متن کامل

Brownian Excursions, Critical Random Graphs and the Multiplicative Coalescent

Let (B t (s); 0 s < 1) be reeecting inhomogeneous Brownian motion with drift t ? s at time s, started with B t (0) = 0. Consider the random graph G(n; n ?1 +tn ?4=3), whose largest components have size of order n 2=3. Normalizing by n ?2=3 , the asymptotic joint distribution of component sizes is the same as the joint distribution of excursion lengths of B t (Corollary 2). The dynamics of mergi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ALEA-Latin American Journal of Probability and Mathematical Statistics

سال: 2021

ISSN: ['1980-0436']

DOI: https://doi.org/10.30757/alea.v18-05